heuristic and exact algorithms for generalized bin covering problem
نویسندگان
چکیده
in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.
منابع مشابه
Heuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملTwo new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملApproximation Algorithms for Variable-Sized and Generalized Bin Covering
In this paper, we consider the Generalized Bin Covering problem: We are given m bin types, where each bin of type i has profit pi and demand di. Furthermore, there are n items, where item j has size sj . A bin of type i is covered if the set of items assigned to it has total size at least the demand di. In that case, the profit of pi is earned and the objective is to maximize the total profit. ...
متن کاملExact and Heuristic Algorithms for Solving the Generalized Minimum Filter Placement Problem
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 CHAPTER
متن کاملExact and Heuristic Algorithms for the Partition Coloring Problem
We study the Partition Coloring Problem (PCP), a generalization of the Vertex Coloring Problem where the vertex set is partitioned. The PCP asks to select one vertex for each subset of the partition in such a way that the chromatic number of the induced graph is minimum. We propose a new Integer Linear Programming formulation with an exponential number of variables. To solve this formulation to...
متن کاملExact and Heuristic Algorithms for Multi-constrained Path Selection Problem
The multi-constrained path (MCP) selection problem occurs when the quality of services (QoS) are supported for point-to-point connections in the distributed multimedia applications deployed on the Internet. This NP-complete problem is concerned how to determine a feasible path between two end-points, so that a set of QoS path constraints can be satisfied simultaneously. Based on the branch-and-...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of algorithms and computationجلد ۴۷، شماره ۱، صفحات ۵۳-۶۲
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023